Complexity of the Normalization of Algebras
نویسندگان
چکیده
We introduce and develop new techniques to study the complexity of normalization processes of graded algebras. The construction of a new degree function on graded modules, with a global nature, permits a broad extension of recent bounds for the length of the chains of subalgebras that general algorithms must transverse to build the integral closure, particularly of blowup algebras. It achieves this by relating the values of the new degree with invariants of the algebra known ab initio. As a by-product, it reveals new inequalities among Hilbert coefficients. Mathematics Subject Classification (2000): Primary 13A30, 13B21, 13D40; Secondary 13H10, 13H15
منابع مشابه
k-NORMALIZATION AND (k + 1)-LEVEL INFLATION OF VARIETIES
Let τ be a type of algebras. A common measurement of the complexity of terms of type τ is the depth of a term. For k ≥ 1, an identity s ≈ t of type τ is said to be k-normal (with respect to this depth complexity measurement) if either s = t or both s and t have depth ≥ k. A variety is called k-normal if all its identities are k-normal. Taking k = 1 with respect to the usual depth valuation of t...
متن کاملHomotopy algebras and the inverse of the normalization functor
In this paper, we investigate multiplicative properties of the classical Dold–Kan correspondence. The inverse of the normalization functor maps commutative differential graded algebras to E∞algebras. We prove that it in fact sends algebras over arbitrary differential graded E∞-operads to E∞-algebras in simplicial modules and is part of a Quillen adjunction. More generally, this inverse maps hom...
متن کاملSpeech Enhancement by Modified Convex Combination of Fractional Adaptive Filtering
This paper presents new adaptive filtering techniques used in speech enhancement system. Adaptive filtering schemes are subjected to different trade-offs regarding their steady-state misadjustment, speed of convergence, and tracking performance. Fractional Least-Mean-Square (FLMS) is a new adaptive algorithm which has better performance than the conventional LMS algorithm. Normalization of LMS ...
متن کاملA Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs
An infeasible interior-point algorithm for mixed symmetric cone linear complementarity problems is proposed. Using the machinery of Euclidean Jordan algebras and Nesterov-Todd search direction, the convergence analysis of the algorithm is shown and proved. Moreover, we obtain a polynomial time complexity bound which matches the currently best known iteration bound for infeasible interior-point ...
متن کاملSimplicial normalization in the entire cyclic cohomology of Banach algebras
We show that the entire cyclic cohomology of Banach algebras defined by Connes has the simplicial normalization property. A key tool in the proof is the notion and properties of supertraces on the Cuntz algebra QA. As an example of further applications of this technique we give a proof of the homotopy invariance of entire cyclic cohomology.
متن کامل